ar X iv : 1 71 0 . 02 86 1 v 1 [ cs . C L ] 8 O ct 2 01 7 Clickbait detection using word embeddings
نویسندگان
چکیده
Clickbait is a pejorative term describing web content that is aimed at generating online advertising revenue, especially at the expense of quality or accuracy, relying on sensationalist headlines or eyecatching thumbnail pictures to attract click-throughs and to encourage forwarding of the material over online social networks. We use distributed word representations of the words in the title as features to identify clickbaits in online news media. We train a machine learning model using linear regression to predict the cickbait score of a given tweet. Our methods achieve an F1-score of 64.98% and an MSE of 0.0791. Compared to other methods, our method is simple, fast to train, does not require extensive feature engineering and yet moderately effective.
منابع مشابه
ar X iv : 0 71 0 . 35 19 v 1 [ cs . C C ] 1 8 O ct 2 00 7 P - matrix recognition is co - NP - complete
This is a summary of the proof by G.E. Coxson [1] that P-matrix recognition is co-NP-complete. The result follows by a reduction from the MAX CUT problem using results of S. Poljak and J. Rohn [5].
متن کاملar X iv : 1 71 0 . 05 14 0 v 1 [ cs . C C ] 1 4 O ct 2 01 7 On complexity of multidistance graph recognition in R 1 Mikhail Tikhomirov
Let A be a set of positive numbers. A graph G is called an Aembeddable graph in R if the vertices of G can be positioned in R so that the distance between endpoints of any edge is an element of A. We consider the computational problem of recognizing A-embeddable graphs in R1 and classify all finite sets A by complexity of this problem in several natural variations.
متن کاملNormality of the Ehrenfeucht-Mycielski Sequence
We study the binary Ehrenfeucht Mycielski sequence seeking a balance between the number of occurrences of different binary strings. There have been numerous attempts to prove the balance conjecture of the sequence, which roughly states that 1 and 0 occur equally often in it. Our contribution is twofold. First, we study weaker forms of the conjecture proved in the past and lay out detailed proof...
متن کاملar X iv : c s / 01 10 03 8 v 1 [ cs . C C ] 1 8 O ct 2 00 1 Counting Is Easy †
For any fixed k, a remarkably simple single-tape Turing machine can simulate k independent counters in real time.
متن کاملar X iv : 0 71 0 . 02 56 v 1 [ he p - la t ] 1 O ct 2 00 7 Charmonium spectrum including higher spin and exotic states
We study the charmonium spectrum including higher spin and exotic states. We use the Sheikholeslami-Wilson (clover) action for N f = 2 sea quarks as well as for the charm valence quark. In order to access excited states we apply a variational method with a basis of highly optimized operators.
متن کامل